A Refined Tableau Calculus with Controlled Blocking for the Description Logic SHOI Mohammad Khodadadi, Renate A. Schmidt, and Dmitry Tishkovsky? School of Computer Science, The University of Manchester, UK Abstract The

Source URL: www.cs.man.ac.uk

Selmer Bringsjord Professor of Cognitive Science • Professor of Computer Science Professor of Logic & Philosophy • Professor of Management Chair, Dept of Cognitive Science • Director, Rensselaer AI & Reasoning (RAI

Source URL: kryten.mm.rpi.edu

Under consideration for publication in Theory and Practice of Logic Programming 1 Clingo = ASP + Control: Preliminary Report Martin Gebser1,2 , Roland Kaminski2 , Benjamin Kaufmann2 , and Torsten Schaub2 ∗

Source URL: www.cs.uni-potsdam.de

• Logic programming
• Mathematical logic
• Constraint programming
• Logic in computer science
• Programming paradigms
• Satisfiability modulo theories
• Answer set programming
• Stable model semantics
• G-code
• Subroutine
• Analogy
• Algorithm

Representing Aggregators in Relational Probabilistic Models David Buchman⇤ Department of Computer Science University of British Columbia Vancouver, BC, Canada

Source URL: www.cs.ubc.ca

• Model theory
• Predicate logic
• Statistical models
• Regression analysis
• Probability theory
• Bayesian network
• Exchangeable random variables
• FO
• Type
• Expected value
• Joint probability distribution
• Quantifier

Compositional Verification of a Baby Virtual Memory Manager Alexander Vaynberg and Zhong Shao Yale University Abstract. A virtual memory manager (VMM) is a part of an operating system

Source URL: flint.cs.yale.edu

• Formal methods
• Logic in computer science
• Models of computation
• Programming language semantics
• Abstraction
• Kernel
• Abstract state machines
• Semantics
• Denotational semantics
• Operational semantics
• Refinement
• Limit

A Refined Tableau Calculus with Controlled Blocking for the Description Logic SHOI Mohammad Khodadadi, Renate A. Schmidt, and Dmitry Tishkovsky? School of Computer Science, The University of Manchester, UK Abstract The

Source URL: www.mettel-prover.org

Cailin O’Connor Department of Logic and Philosophy of Science University of California, Irvine 3151 Social Science Plaza A Irvine, CA

Source URL: cailinoconnor.com

Degrees of undecidability of in Term Rewriting J¨org Endrullis, Herman Geuvers, Hans Zantema Radboud University Nijmegen, Technical University Eindhoven, Free University Amsterdam, The Netherlands CSL 2009

Source URL: www.cs.ru.nl

• Theoretical computer science
• Mathematics
• Logic
• Mathematical logic
• Formal languages
• Logic in computer science
• Automated theorem proving
• Logic programming
• Rewriting
• Confluence
• Rewrite order
• Substitution

A Theorem Proving Approach to Secure Information Flow in Concurrent Programs (Extended Abstract) Daniel Bruns, Karlsruhe Institute of Technology We present an approach to formally prove secure information flow in multi-t

Source URL: software.imdea.org

• Theoretical computer science
• Logic in computer science
• Formal methods
• Mathematical logic
• KeY
• Formal verification
• Dynamic logic
• Automated theorem proving
• Logic
• Language-based security

Scheme-based Theorem Discovery and Concept Invention O. Montano-Rivasa , R. McCaslanda , L. Dixona , A. Bundya a School of Informatics, University of Edinburgh, Informatics Forum, 10 Crichton Street,

Source URL: dream.inf.ed.ac.uk

• Automated theorem proving
• Logic programming
• Logic in computer science
• Computability theory
• Algebraic topology
• Substitution
• Unification
• Lambda calculus
• Sheaf
• Scheme
• Combinatory logic
• Morphism of algebraic varieties